Logical equivalence between generalized urn models and finite automata
نویسنده
چکیده
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
منابع مشابه
Contexts in quantum, classical and partition logic
IV. Automata and generalized urn logic 11 A. Partition logic 13 B. Generalized urn models 13 C. Automaton models 13 D. Proof of logical equivalence 14 1. Direct construction of automaton models from generalized urn models 14 2. Direct construction of generalized urn models from automaton models 14 3. Schemes using dispersion-free states 14 4. Example 1: The generalized urn logic L12 16 5. Examp...
متن کاملCDMTCS Research Report Series Logical Equivalence Between Generalized Urn Models and Finite Automata
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well. Introduction of concepts In what follows we shall explicitly and constructively demonstrate the equivalence of the empirical logics (i.e., the propositional calculi) associated with the generalized urn models (GUM) suggested by Ron Wright [Wright(1978), Wri...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملNew Haven , CT 06520 – 8285 Urn Automata
Urn automata are a new class of automata consisting of an input tape, a finite-state controller, and an urn containing tokens with a finite set of colors, where the finite-state controller can sample and replace tokens in the urn but cannot control which tokens it receives. We consider the computational power of urn automata, showing that an urn automaton with O(f(n)) tokens can, with high prob...
متن کاملUrn Automata
Urn automata are a new class of automata consisting of an input tape, a finite-state controller, and an urn containing tokens with a finite set of colors, where the finite-state controller can sample and replace tokens in the urn but cannot control which tokens it receives. We consider the computational power of urn automata, showing that an urn automaton with O(f(n)) tokens can, with high prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002